Uniform Recognition for Acyclic Context-Sensitive Grammars is NP-complete
نویسنده
چکیده
Context-sensitive grammars in which each rule is of the forln aZfl-~ (-*Tfl are acyclic if the associated context-free grammar with the rules Z ~ 3' is acyclic. The problem whether an intmt string is in the language generated by an acyclic context-sensitive grammar is NP-conlplete.
منابع مشابه
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars
Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a lowdegree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.
متن کاملBetween a Rock and a Hard Place – Parsing for Hyperedge Replacement DAG Grammars
We study the uniform membership problem for hyperedgereplacement grammars that generate directed acyclic graphs. The study of this type of language is motivated by applications in natural language processing. Our major result is a low-degree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions ...
متن کاملOrder-Preserving DAG Grammars, Parsing Complexity, and Learning
Hyperedge replacement grammars (HRGs, see [7, 6]) are one of the most successful formal models for the generative specification of graph languages, thanks to the fact that their language-theoretic and algorithmic properties to a great extent resemble those of contextfree grammars. Unfortunately, polynomial parsing is an exception from this general rule: graph languages generated by HRGs may be ...
متن کاملComplexity of Uniform Membership of Context-Free Tree Grammars
We show that the uniform membership problem of context-free tree grammars is PSPACE-complete. The proof of the upper bound is by construction of an equivalent pushdown tree automaton representable in polynomial space. With this technique, we can also give an alternative proof that the respective nonuniform membership problem is in NP. A corollary for uniform membership of "-free indexed grammar...
متن کاملJavier Esparza / Petri nets , Commutative Context - Free
The paper provides a structural characterisation of the reachable markings of Petri nets in which every transition has exactly one input place. As a corollary, the reachability problem for this class is proved to be NP-complete. Further consequences are: the uniform word problem for commutative context-free grammars is NP-complete; weak-bisimilarity is semidecidable for Basic Parallel Processes.
متن کامل